Drawing Power Law Graphs Using a Local/Global Decomposition
نویسندگان
چکیده
منابع مشابه
Drawing Power Law Graphs
We present methods for drawing graphs that arise in various information networks. It has been noted that many realistic graphs have power law degree distribution and exhibit the small world phenomenon. Our algorithm is influenced by recent developments on modeling and analysis of such power law graphs.
متن کاملDrawing graphs using modular decomposition
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our algorithm works by traversing the modular decomposition tree of the input graph G on n vertices and m edges, in a bottom-up fashion until it reaches the root of the tree, while at the same time intermediate drawings ar...
متن کاملScalable Visualization of Semantic Nets using Power-Law Graphs
Scalability and performance implications of semantic net visualization techniques are open research challenges. This paper focuses on developing a visualization technique that mitigates these challenges. We present a novel approach that exploits the underlying concept of power-law degree distribution as many realistic semantic nets seems to possess a power law degree distribution and present a ...
متن کاملDrawing Graphs Within Graphs
The task of drawing subgraphs is often underestimated and they are simply emphasized using different colors or line styles. In this paper, we present an approach for drawing graphs within graphs that first produces a layout for the subgraphs thus increasing their locality. We introduce connection sets stressing relationships between several subgraphs. In a case study, we demonstrate how they ca...
متن کاملCompact Routing in Power-Law Graphs
We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted random power-law graphs with fixed expected degree sequence by Aiello, Chung, and Lu. Our result is the first theoretical bound coupled to the parameter of the power-law graph model for a compact routing scheme. In particular, we pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2007
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-006-3160-3